Unsupervised Learning with the Soft-means Algorithm
نویسنده
چکیده
This note describes a useful adaptation of thèpeak seeking' regime used in unsupervised learning processes such as competitive learning and`k-means'. The adaptation enables the learning to capture low-order probability eeects and thus to more fully capture the probabilistic structure of the training data.
منابع مشابه
High-Dimensional Unsupervised Active Learning Method
In this work, a hierarchical ensemble of projected clustering algorithm for high-dimensional data is proposed. The basic concept of the algorithm is based on the active learning method (ALM) which is a fuzzy learning scheme, inspired by some behavioral features of human brain functionality. High-dimensional unsupervised active learning method (HUALM) is a clustering algorithm which blurs the da...
متن کاملUnsupervised learning with normalised data and non-Euclidean norms
The measurement of distance is one of the key steps in the unsupervised learning process, as it is through these distance measurements that patterns and correlations are discovered. We examined the characteristics of both non-Euclidean norms and data normalisation within the unsupervised learning environment. We empirically assessed the performance of the K-means, Neural Gas, Growing Neural Gas...
متن کاملUnsuperised classification by soft computing techniques: algorithms of fuzzy -means clustering
We overview methods of fuzzy -means clustering as a representative techniques of unsupervised classification by soft computing. The basic framework is the alternate optimization algorithm originally proposed by Dunn and Bezdek is reviewed and two more objective functions are introduced. An additional variable of controlling volume size is included as an extension. Moreover a method of the kerne...
متن کاملFuzzy soft rough K-Means clustering approach for gene expression data
Clustering is one of the widely used data mining techniques for medical diagnosis. Clustering can be considered as the most important unsupervised learning technique. Most of the clustering methods group data based on distance and few methods cluster data based on similarity. The clustering algorithms classify gene expression data into clusters and the functionally related genes are grouped tog...
متن کاملSoft-to-hard Model Transition in Clustering: a Review
Clustering analysis often employs unsupervised learning techniques originally developed for vector quantization. In this framework, a frequent goal of clustering systems is to minimize the quantization error, which is aaected by many local minima. To avoid connnement of reference vectors to local minima of the quantization error and to avoid formation of dead units, hard c-means clustering algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994